Model checking mobile stochastic logic
نویسندگان
چکیده
The TemporalMobile Stochastic Logic (MOSL) has been introduced in previous work by the authors for formulating properties of systems specified in STOKLAIM, a Markovian extension of KLAIM. The main purpose of MOSL is to address key functional aspects of global computing such as distribution awareness, mobility, and security and their integration with performance and dependability guarantees. In this paper, we present MOSL, an extension of MOSL, which incorporates some basic features of the Modal Logic for MObility (MOMO), a logic specifically designed for dealing with resource management and mobility aspects of concurrent behaviours. We also show how MOSL formulae can be model-checked against STOKLAIM specifications. For this purpose, we show how existing state-based stochastic model-checkers, like e.g. the Markov Reward Model Checker (MRMC), can be exploited by using a front-end for STOKLAIM that performs appropriate pre-processing of MOSL formulae. The proposed approach is illustrated by modelling and verifying a sample system. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Model Checking Functional and Performability Properties of Stochastic Fluid Models
Model checking of stochastic processes has been introduced to verify functional as well as performability properties of formally specified systems. In this paper, model checking for a wide class of stochastic fluid models (SFMs) is considered. We present a branching time temporal logic, which is similar to the continuous stochastic logic (CSL), for expressing real-time probabilistic properties ...
متن کاملModel Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formally-specified system. In recent years, we have extended CTL such that it allows for the specification of properties over finite-state continuous-time Markov chains (CTMCs). Computational techniques for model chec...
متن کاملMulti-Objective Policy Generation for Mobile Robots under Probabilistic Time-Bounded Guarantees
We present a methodology for the generation of mobile robot controllers which offer probabilistic time-bounded guarantees on successful task completion, whilst also trying to satisfy soft goals. The approach is based on a stochastic model of the robot’s environment and action execution times, a set of soft goals, and a formal task specification in co-safe linear temporal logic, which are analys...
متن کاملCASPA: Symbolic model checking of stochastic systems
This note describes the new features of the performance evaluation tool CASPA, which has been extended by algorithms for the model checking of stochastic systems. CASPA uses stochastic process algebras as its input language. Multi-terminal binary decision diagrams (MTBDD) are employed to represent the transition system underlying a given process algebraic specification. The specification of per...
متن کاملBisimulation, Logic and Reachability Analysis for Markovian Systems
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verification is called stochastic reachability analysis, while in computer science this is called probabilistic model checking (PMC). In the context of this work, we consider the two terms interchangeable. It is worthy to note...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 382 شماره
صفحات -
تاریخ انتشار 2007